By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

Routing with Polynomial Communication-Space Srade-ff

Baruch Awerbuch and David Peleg

pp. 151-162

Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization

E. Boros, Y. Crama, and P. L. Hammer

pp. 163-177

Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults

Luisa Gargano and Ugo Vaccaro

pp. 178-198

Hamilton Paths in Graphs of Linear Extensions for Unions of Posets

Grzegorz Stachowiak

pp. 199-206

On the Nonmultiplicativity of Oriented Cycles

Huishan Zhou

pp. 207-218

Normal Limiting Distributions for Projection and Semijoin Sizes

Danièle Gardy

pp. 219-248

Triangulating 3-Colored Graphs

Sampath K. Kannan and Tandy J. Warnow

pp. 249-258

Three-Stage Generalized Connectors

Richard M. Karp

pp. 259-272

Privacy and Communication Complexity

Eyal Kushelvitz

pp. 273-284

An Optimal Algorithm for the Maximum Two-Chain Problem

R. D. Lou, M. Sarrafzadeh, and D. T. Lee

pp. 285-304